Hanne Bruun: Talkshowet. Portræt af en tv-genre

Hanne Lehn

Uffe Haagerup , Hanne Schultz and Steen Thorbjørnsen

In 1982 Pimsner and Voiculescu computed the K0and K1-groups of the reduced group C∗-algebra C∗ red(Fk) of the free group Fk on k generators and settled thereby a long standing conjecture: C∗ red(Fk) has no projections except for the trivial projections 0 and 1. Later simpler proofs of this conjecture were found by methods from K-theory or from non-commutative differential geometry. In this pape...

New FFT structures based on the Bruun algorithm

In some signal processing applications, the input data are real. In this case, the Bruun algorithm for computation of the Discrete Fourier Transform (DFT) is attractive. This correspondence offers a pipeline and a recirculated shuffle network implementation of the Bruun algorithm. The parallel pipeline and recirculated FFT structures are implemented based on the modified perfect shuffle network.

Uncertainties in Sandy Shorelines Evolution under the Bruun Rule Assumption

In the current practice of sandy shoreline change assessments, the local sedimentary budget is evaluated using the sediment balance equation, that is, by summing the contributions of longshore and cross-shore processes. The contribution of future sea-level rise induced by climate change is usually obtained using the Bruun rule, which assumes that the shoreline retreat is equal to the change of ...

Tessellations of random maps of arbitrary genus (Mosäıques sur des cartes aléatoires en genre arbitraire)

We investigate Voronoi-like tessellations of bipartite quadrangulations on surfaces of arbitrary genus, by using a natural generalization of a bijection of Marcus and Schaeffer allowing one to encode such structures by labeled maps with a fixed number of faces. We investigate the scaling limits of the latter. Applications include asymptotic enumeration results for quadrangulations, and typical ...